|
|
Intrusion detection system for Mikrotik-based network
Zvařič, Filip ; Frolka, Jakub (referee) ; Krajsa, Ondřej (advisor)
This bachelor's thesis focuses on network attacks and ways to defend against them. It discusses the most common attacks that can be encountered and their impact on computer networks and end user. Finally, it includes steps for implementing a protection system in collaboration with the preventive software Snort and RouterOS operating system. This system's toughness is tested and results are processed.
|
|
|
Automatic Grouping of Regular Expressions
Stanek, Timotej ; Kořenek, Jan (referee) ; Kaštil, Jan (advisor)
This project is about security of computer networks using Intrusion Detection Systems. IDS contain rules for detection expressed with regular expressions, which are for detection represented by finite-state automata. The complexity of this detection with non-deterministic and deterministic finite-state automata is explained. This complexity can be reduced with help of regular expressions grouping. Grouping algorithm and approaches for speedup and improvement are introduced. One of the approches is Genetic algorithm, which can work real-time. Finally Random search algorithm for grouping of regular expressions is presented. Experiment results with these approches are shown and compared between each other.
|
|
|
Intrusion detection system for Mikrotik-based network
Zvařič, Filip ; Frolka, Jakub (referee) ; Krajsa, Ondřej (advisor)
This bachelor's thesis focuses on network attacks and ways to defend against them. It discusses the most common attacks that can be encountered and their impact on computer networks and end user. Finally, it includes steps for implementing a protection system in collaboration with the preventive software Snort and RouterOS operating system. This system's toughness is tested and results are processed.
|
|
|
Automatic Grouping of Regular Expressions
Stanek, Timotej ; Kořenek, Jan (referee) ; Kaštil, Jan (advisor)
This project is about security of computer networks using Intrusion Detection Systems. IDS contain rules for detection expressed with regular expressions, which are for detection represented by finite-state automata. The complexity of this detection with non-deterministic and deterministic finite-state automata is explained. This complexity can be reduced with help of regular expressions grouping. Grouping algorithm and approaches for speedup and improvement are introduced. One of the approches is Genetic algorithm, which can work real-time. Finally Random search algorithm for grouping of regular expressions is presented. Experiment results with these approches are shown and compared between each other.
|
guest ::
